Browsing by Subject "Programming (Mathematics)"
Now showing items 1-7 of 7
-
(Texas A&M University. Libraries, 1980)In this dissertation, an algorithm was developed to solve large scale discrete nonlinear knapsack problems (NKP) with multiple resource constraints. The algorithm is essentially a dynamic programming technique in a sense ...
-
(Texas A&M University, 1992)Not available
-
(Texas A&M University. Libraries, 1980)Dynamic programming models are typically solved by considering discrete values of the decision and state variables. Solutions are tabular inform, showing the best decision for discrete values of the state variable. For ...
-
(Texas A&M University. Libraries, 1980)The presented language is used for design and prototype implementation of application graphics systems. By usual methods it is not feasible to test a system in the user environment until near completion. Incorporation of ...
-
(Texas A&M University. Libraries, 1981)Frequently algorithm users can select their solution strategy by choosing from among various options for each of several algorithm factors. If the algorithm will always eventually find a solution, the important question ...
-
(Texas A&M University, 1991)Not available
-
(Texas A&M University, 1976)Not available